Computability on finite linear configurations.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Finite-time Computability Preserving Conversions

A finite-time computable function is a partial function from Σ to Σ whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computability preserving conversion α : X → Y for X,Y ⊂ Σ is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain Σ are extended sliding b...

متن کامل

On linear normal lattices configurations

In this paper we extend Champernowne’s construction of normal numbers in base b to the Z case and obtain an explicit construction of the generic point of the Z shift transformation of the set {0, 1, ..., b−1}Zd . We prove that the intersection of the considered lattice configuration with an arbitrary line is a normal sequence in base b .

متن کامل

On BEL-configurations and finite semifields

In this talk we will explain the Knuth orbit of a semifield S: a set of six isotopism classes of semifields associated to S (from [2]), and discuss ways of extending it, using techniques from finite geometry. A BEL-configuration in Frn q is a triple (D, U,W ), where D is a Desarguesian spread, and U and W are subspaces of dimension n and rn− n, resp., such that no element of D intesects both U ...

متن کامل

1 Finite Point Configurations

The study of combinatorial properties of finite point configurations is a vast area of research in geometry, whose origins go back at least to the ancient Greeks. Since it includes virtually all problems starting with “consider a set of n points in space,” space limitations impose the necessity of making choices. As a result, we will restrict our attention to Euclidean spaces and will discuss p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1975

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093891794